On the enumeration of positive cells in generalized cluster complexes and Catalan hyperplane arrangements

نویسندگان

  • Christos A. Athanasiadis
  • Eleni Tzanaki
چکیده

Let Φ be an irreducible crystallographic root system with Weyl group W and coroot lattice Q̌, spanning a Euclidean space V . Let m be a positive integer and AmΦ be the arrangement of hyperplanes in V of the form (α, x) = k for α ∈ Φ and k = 0, 1, . . . ,m. It is known that the number N(Φ, m) of bounded dominant regions of AmΦ is equal to the number of facets of the positive part ∆ m + (Φ) of the generalized cluster complex associated to the pair (Φ, m) by S. Fomin and N. Reading. We define a statistic on the set of bounded dominant regions of AmΦ and conjecture that the corresponding refinement of N(Φ, m) coincides with the h-vector of ∆m+ (Φ). We compute these refined numbers for the classical root systems as well as for all root systems when m = 1 and verify the conjecture when Φ has type A, B or C and when m = 1. We give several combinatorial interpretations to these numbers in terms of chains of order ideals in the root poset of Φ, orbits of the action of W on the quotient Q̌/ (mh − 1) Q̌ and coroot lattice points inside a certain simplex, analogous to the ones given by the first author in the case of the set of all dominant regions of AmΦ . We also provide a dual interpretation in terms of order filters in the root poset of Φ in the special case m = 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Cluster Complexes and Coxeter Combinatorics

In the first part of this paper (Sections 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, and 12), we introduce and study a simplicial complex ∆(Φ) associated to a finite root system Φ and a nonnegative integer parameter m. For m = 1, our construction specializes to the (simplicial) generalized associahedra ∆(Φ) introduced in [13] and identified in [14] as the underlying complexes for the cluster algebras of f...

متن کامل

Facets of the Generalized Cluster Complex and Regions in the Extended Catalan Arrangement of Type A

In this paper we present a bijection between two well known families of Catalan objects: the set of facets of the m-generalized cluster complex ∆(An) and that of dominant regions in the m-Catalan arrangement Cat(An), where m ∈ N>0. In particular, the map which we define bijects facets containing the negative simple root −α to dominant regions having the hyperplane {v ∈ V | 〈v, α〉 = m} as separa...

متن کامل

The Catalan Threshold Arrangement

Hyperplane arrangements are very interesting combinatorial objects and many results can be found in the literature. For instance, several papers [1, 2, 6, 7] are concerned with the characteristic polynomials and the number of regions of a hyperplane arrangement. In his paper [9], Stanley reviewed various hyperplane arrangements raising interesting questions, one of which is related to the follo...

متن کامل

Enumeration in Algebra and Geometry

This thesis is devoted to solution of two classes of enumerative problems. The first class is related to enumeration of regions of hyperplane arrangements. We investigate deformations of Coxeter arrangements. In particular, we prove a conjecture of Stanley on the numbers of regions of Linial arrangements. These numbers have several additional combinatorial interpretations in terms of trees, par...

متن کامل

A new algorithm for enumeration of cells of hyperplane arrangements and a comparison with Avis-Fukuda’s Reverse Search

We design a new algorithm, called Incremental Enumeration (IncEnu), for enumeration of full-dimensional cells of hyperplane arrangements (or dually, for enumeration of vertices of generator-presented zonotopes). The algorithm is based on an incremental construction of the graph of cells of the arrangement. IncEnu is compared to Avis-Fukuda’s Reverse Search (RS), including its later improvements...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006